A Space Efficient Randomized Dna Algorithm for K �
نویسندگان
چکیده
We present a randomized DNA algorithm for k SAT based on the classical algorithm of Paturi et al For an n variable m clause instance of k SAT m n our algorithm nds a satisfying assignment assuming one exists with probability e in worst case time O k mn and space O k n log This makes it the most space e cient DNA k SAT algo rithm for k and k n log i e the clause size is small compared to the number of variables In addition our algorithm is the rst DNA algorithm to adapt techniques from the eld of randomized classical algorithms
منابع مشابه
A Space-Efficient Randomized DNA Algorithm for k-SAT
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1−e−α, in worst-case time O(kmn) and space O(2(1− 1 k ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ logα (i.e. the clau...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملAN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES
In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...
متن کاملSpace-Efficient Las Vegas Algorithms for K-SUM
Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for k-SUM problems. This family includes an algorithm that can solve 3-SUM in O(n) time and O( √ n) space. It also establishes a new time-space upper bound for SUBSETSUM, which can be solved by a Las Vegas algorithm in O(2 √ 8 9 ) time and O(2) space, for any β ∈ [0, 9 32 ].
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کامل